Solving non-linear Horn clauses using a linear Horn clause solver
نویسندگان
چکیده
منابع مشابه
Solving non-linear Horn clauses using a linear Horn clause solver
ion Refinement CHC P k = 0,S = / 0 Lin P′,S,k LS (safe, R↑P) R solution P? No S← R,k = k+1 S,R,k CA S← S|R,k (unsafe, R) S = S|R? Figure 7: Abstraction-refinement scheme for solving non-linear Horn clauses using a solver for linear Horn clauses. P′ is a set of linear CHC obtained by linearising the at-most-k-dimension underapproximation, P≤k, of P. The soundness of Algorithms 1 and 2 is capture...
متن کاملSolving non-linear Horn clauses using a linear solver
Developing an efficient non-linear Horn clause solver is a challenging task since the solver has to reason about the tree structures rather than the linear ones as in a linear solver. In this paper we propose an incremental approach to solving a set of non-linear Horn clauses using a linear Horn clause solver. We achieve this by interleaving a program transformation and a linear solver. The pro...
متن کاملSolving Constrained Horn Clauses using Interpolation
We present an interpolation-based method for symbolically solving systems of constrained Horn clauses. The method can be used to solve for unknown predicates in the verification conditions of programs. Thus, it has a variety of applications, including including model checking of recursive and threaded programs. The method is implemented in tool called Duality, which we evaluate using device dri...
متن کاملSolving Existentially Quantified Horn Clauses
Temporal verification of universal (i.e., valid for all computation paths) properties of various kinds of programs, e.g., procedural, multi-threaded, or functional, can be reduced to finding solutions for equations in form of universally quantified Horn clauses extended with well-foundedness conditions. Dealing with existential properties (e.g., whether there exists a particular computation pat...
متن کاملA Horn Clause that Implies and Undecidable Set of Horn Clauses
In this paper we prove that there exists a Horn clause H such that the problem: given a Horn clause G. Is G a consequence of H ? is not recursive. Equivalently, there exists a one-clause PROLOG program such that there is no PROLOG implementation answering TRUE if the program implies a given goal and FALSE otherwise. We give a short survey of earlier results concerning clause implication and pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2016
ISSN: 2075-2180
DOI: 10.4204/eptcs.219.4